package com.example.leetdemo.process;

public class Solution2400 {
    public int numberOfWays(int startPos, int endPos, int k) {
        int step = Math.abs(endPos - startPos);
        if ((k - step) % 2 != 0 || k < step) {
            return 0;
        }

        return 1;
    }
}
